Hamilton cycles in double generalized Petersen graphs
نویسندگان
چکیده
منابع مشابه
Hamilton paths in generalized Petersen graphs
This thesis puts forward the conjecture that for n > 3k with k > 2, the generalized Petersen graph, GP (n, k) is Hamilton-laceable if n is even and k is odd, and it is Hamilton-connected otherwise. We take the first step in the proof of this conjecture by proving the case n = 3k + 1 and k ≥ 1. We do this mainly by means of an induction which takes us from GP (3k + 1, k) to GP (3(k+2)+1, k+2). T...
متن کاملDouble Total Domination on Generalized Petersen Graphs
A set S of vertices in a graph G is a double total dominating set, abbreviated DTDS, of G if every vertex of G is adjacent to least two vertices in S. The minimum cardinality of a DTDS of G is the double total domination number of G. In this paper, we study the DTDS of the generalized Petersen graphs. Mathematics Subject Classification: 05C35
متن کاملGraceful labelings of the generalized Petersen graphs
A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...
متن کاملOptimal Generalized Petersen Graphs
In this paper we establish a theorem on the maximum number of vertices of a generalized Petersen graph as a function of the diameter.
متن کاملHyper-Hamiltonian generalized Petersen graphs
Assume that n and k are positive integers with n ≥ 2k + 1. A non-hamiltonian graph G is hypo hamiltonian if G − v is hamiltonian for any v ∈ V (G). It is proved that the generalized Petersen graph P (n, k) is hypo hamiltonian if and only if k = 2 and n ≡ 5 (mod 6). Similarly, a hamiltonian graph G is hyper hamiltonian if G−v is hamiltonian for any v ∈ V (G). In this paper, we will give some nec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2019
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2062